Designing codes with approaching shannon ' s capacity performance and low coding and decoding complexity is a challenging and meaningful issue in channel coding field 設計性能逼近信道容量、編譯碼復雜度較低的實用好碼是信道編碼領域中最重要的工作之一。
Turbo code was introduced by c . berrou in 1993 . turbo code can achieve the error correcting capacity close to the shannon - limit with reasonable decoding complexity , provided that the code words are long enough 1993年, c . berrou提出了一種新的信道編碼方案? ? turbo碼, turbo碼能夠在編碼長度較長的情況下得到接近香農極限的糾錯性能。
Its decoding complexity is also lower than turbo code . recently , ldpc code has drawn the worldwide attentions in channel coding community due to its high performance and strong potential applications in practice Ldpc碼的數學定義非常簡單,具有較大的靈活性,當碼長足夠長時的非正規ldpc碼具有比turbo碼更為良好的性能,其譯碼復雜度低于turbo碼。
Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes . with advantages of high encoding gain , low decoding complexity and flexible code rates , etc . , the research of these codes has become a hot spot of coding academia 低密度校驗碼( ldpc )性能接近香農限,具有編碼增益高、譯碼簡單快捷、碼率靈活等優點,是當前編碼界的研究熱點。
3 . by theoretical analysis and simulation , quantization decoding of ldpc codes is studied . an efficient quantization - decoding scheme is proposed which can greatly reduce the decoding complexity with a little performance loss 采用理論分析和仿真相結合的方法研究了ldpc碼的量化譯碼,提出了一種高效的量化譯碼實現方案,該方案能夠大大降低譯碼復雜度,同時譯碼性能非常接近連續譯碼。